Exact Computation of Minimum Feedback Vertex Sets with Relational Algebra
نویسندگان
چکیده
A feedback vertex set of a graph is a subset of vertices containing at least one vertex from every cycle of the graph. Given a directed graph by its adjacency relation, we develop a relational algorithm for computing a feedback vertex set of minimum size. In combination with a BDD-implementation of relations, it allows to exactly solve this NP-hard problem for medium-sized graphs.
منابع مشابه
Exact Computation of Maximum Induced Forest
We propose a backtrack algorithm that solves a generalized version of the Maximum Induced Forest problem (MIF) in time O∗(1.8899n). The MIF problem is complementary to finding a minimum Feedback Vertex Set (FVS), a well-known intractable problem. Therefore the proposed algorithm can find a minimum FVS as well. To the best of our knowledge, this is the first algorithm that breaks the O∗(2n) barr...
متن کاملMinimum Feedback Vertex Sets in Shuffle-based Interconnection Networks
Given a graph G, the problem is to construct a smallest subset S of vertices whose deletion results in an acyclic subgraph. The set S is called a minimum feedback vertex set for G. Tight upper and lower bounds on the cardinality of minimum feedback vertex sets have been obtained for some hypercube–like networks, such as meshes, tori, butterflies, cube-connected cycles and hypercubes. In this pa...
متن کاملLower Bounds to the Size of the Minimum Feedback Vertex Sets in Split-stars
In a graph G = (V,E), a subset F ⊂ V (G) is a feedback vertex set of G if the subgraph induced by V (G) \ F is acyclic. In this paper, we establish a lower bound to the size of the minimum feedback vertex sets in split-stars.
متن کاملFeedback Vertex Sets in Tournaments
We study combinatorial and algorithmic questions around minimal feedback vertex sets in tournament graphs. On the combinatorial side, we derive strong upper and lower bounds on the maximum number of minimal feedback vertex sets in an n-vertex tournament. We prove that every tournament on n vertices has at most 1.6740 minimal feedback vertex sets and that there is an infinite family of tournamen...
متن کاملRelation-algebraic computation of fixed points with applications
We use relational algebra for describing sets and sets of sets and for computing all fixed points of certain functions on powersets. The method is illustrated by some examples from different problem domains, and results of our practical experiments with the RelView system are reported.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fundam. Inform.
دوره 70 شماره
صفحات -
تاریخ انتشار 2006